Phase Transition on The Degree Sequence of a Mixed Random Graph Process
نویسندگان
چکیده
Abstract: This paper focuses on the problem of the degree sequence for a mixed random graph process which continuously combines the classical model and the BA model. Note that the number of step added edges for the mixed model is random and unbounded. By developing a comparing argument, phase transition on the degree distributions of the mixed model is revealed: while the pure classical model possesses a exponential degree sequence, the pure BA model and the mixed model possess power law degree sequences. We point out that the intermediate mixed model can be looked as a BA model with sublinear preferential attachment.
منابع مشابه
Sampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کاملUniversality for distances in power-law random graphs
We survey the recent work on phase transition and distances in various random graph models with general degree sequences. We focus on inhomogeneous random graphs, the configuration model and affine preferential attachment models, and pay special attention to the setting where these random graphs have a power-law degree sequence. This means that the proportion of vertices with degree k in large ...
متن کاملDegree Sequence of Random Permutation Graphs by Bhaswar B. Bhattacharya
In this paper, we study the asymptotics of the degree sequence of permutation graphs associated with a sequence of random permutations. The limiting finite-dimensional distributions of the degree proportions are established using results from graph and permutation limit theories. In particular, we show that for a uniform random permutation, the joint distribution of the degree proportions of th...
متن کاملPhase transition of the minimum degree random multigraph process
We study the phase transition of the minimum degree multi-graph process. We prove that for a constant hg ≈ 0.8607, with probability tending to 1 as n → ∞, the graph consists of small components on O(log n) vertices when the number of edges of a graph generated so far is smaller than hgn, the largest component has order roughly n when the number of edges added is exactly hgn, and the graph consi...
متن کاملAre randomly grown graphs really random?
We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined by an undirected edge. This process is repeated for t time steps. In the limit of large t, the resulting graph displays surprisingly rich characteristics. In particular, a giant component emerges in an infinite-order phas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009